#ifndef SEARCH_H_INCLUDED
#define SEARCH_H_INCLUDED
#include "Graph.h"
#include <vector>
#include <map>
#include <queue>

class Search
{
public:

	std::vector<int> DFS(Graph& newGraph, int StartNode, int DestinationNode);
	std::vector<int> BFS(Graph& newGraph, int StartNode, int DestinationNode);
	std::vector<int> Dijkstra(Graph& newGraph, int StartNode, int DestinationNode);
	std::vector<int> AStar(Graph& newGraph, int Startnode, int DestinationNode);
	std::vector<int> CreatePath(int start, int end, std::map<int, int> PathMap);


private:
	

};
#endif